On a nonlinear problem of optimal rendezvous
نویسندگان
چکیده
منابع مشابه
On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملNonlinear Optimal Control Problem
We give wavelet description for nonlinear optimal dynamics (energy minimization in high power electromechanical system). We consider two cases of our general construction. In a particular case we have the solution as a series on shifted Legendre polynomials, which is parametrized by the solution of reduced algebraical system of equations. In the general case we have the solution as a multireso-...
متن کاملAsymptotically Optimal Deterministic Rendezvous
In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph. For this problem, we exhibit some asymptotical time and space lower ...
متن کاملOptimal Symmetric Rendezvous Search on Three Locations
In the symmetric rendezvous search game played on n locations two players are initially placed at two distinct locations. The game is played in discrete steps, at each of which each player can either stay where he is or move to a different location. The players share no common labelling of the locations. We wish to find a strategy such that, if both players follow it independently, then the exp...
متن کاملOptimal Rendezvous Trajectory Using a Hybrid Approach
Genetic algorithms have gained popularity as effective search procedures for obtaining solutions to traditionally difficult space mission optimization problems. In this paper, a real-coded genetic algorithm is used together with calculus of variations to optimize a trajectory for rendezvous problem. The global search properties of genetic algorithm combine with the local search capabilities of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Journal: Science and Innovation
سال: 2020
ISSN: 2308-6033
DOI: 10.18698/2308-6033-2020-4-1974